A convergence proof for local mode filtering
نویسندگان
چکیده
In this paper, we present a convergence proof for an iterative procedure of local mode filtering. We formulate the filtering as quadratic optimization problem based on Legendre transform convex function, from which two closed-form expressions at each iteration step are derived variables to be optimized. Those analytical solutions ensure that value objective function increases monotonically with progress procedure. also show experimental results using grayscale image, support our theoretical practically.
منابع مشابه
On the Convergence of Iterative Filtering Empirical Mode Decomposition
Empirical Mode Decomposition (EMD), an adaptive technique for data and signal decomposition, is a valuable tool for many applications in data and signal processing. One approach to EMD is the iterative filtering EMD, which iterates certain banded Toeplitz operators in l∞(Z). The convergence of iterative filtering is a challenging mathematical problem. In this paper we study this problem, namely...
متن کاملConvergence of a Convolution-Filtering-Based Algorithm for Empirical Mode Decomposition
In [?] Lin, Wang and Zhou propose the iterative Toeplitz filters algorithm as an alternative iterative algorithm for EMD. In this alternative algorithm, the average of the upper and lower envelopes is replaced by certain “moving average” obtained through a low-pass filter. Performing the tradition sifting algorithm with such moving averages is equivlalent to iterating certain convolution filter...
متن کاملA Local Convergence Proof for the Minvar Algorithm for Computing Continuous Piecewise Linear Approximations
The class of continuous piecewise linear (PL) functions represents a useful family of approximants because invertibility can be readily imposed, and if a PL function is invertible, then it can be inverted in closed form. Many applications, arising, for example, in control systems and robotics, involve the simultaneous construction of a forward and inverse system model from data. Most approximat...
متن کاملA proof of convergence for Ant algorithms
A proof of convergence for Ant algorithms is developed. Ant algorithms were modeled as branching random processes: the branching random walk and branching Wiener process to derive rates of birth and death of ant paths. Substitution is then carried out in birth-death processes, which proves that a stable distribution is surely reached. This indicates that Ant algorithms converge with probability...
متن کاملEmpirical Mode Decomposition based Adaptive Filtering for Orthogonal Frequency Division Multiplexing Channel Estimation
This paper presents an empirical mode decomposition (EMD) based adaptive filter (AF) for channel estimation in OFDM system. In this method, length of channel impulse response (CIR) is first approximated using Akaike information criterion (AIC). Then, CIR is estimated using adaptive filter with EMD decomposed IMF of the received OFDM symbol. The correlation and kurtosis measures are used to sel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICT Express
سال: 2021
ISSN: ['2405-9595']
DOI: https://doi.org/10.1016/j.icte.2021.02.008